Solving set-valued constraint satisfaction problems
نویسندگان
چکیده
منابع مشابه
Solving Set Constraint Satisfaction Problems using ROBDDs
Constraint solvers typically maintain a domain of possible values for each variable that may form part of a solution to a constraint satisfaction problem. Historically, it has been thought impractical to represent precisely the domains of certain types of constrained variable, such as finite set variables. For example, the domain of a finite set variable which can take on the value of any subse...
متن کاملAn Incomplete Method for Solving Distributed Valued Constraint Satisfaction Problems
This paper sets a model for Distributed Valued Constraint Satisfaction Problems, and proposes an incompletemethod for solving such problems. This method is a greedy repair distributed algorithm which extends to the distributed case any greedy repair centralized algorithm. Experiments are carried out on a real-world problem and show the practical interest of this method.
متن کاملaspartame: Solving Constraint Satisfaction Problems with Answer Set Programming
Encoding finite linear CSPs as Boolean formulas and solving them by using modern SAT solvers has proven to be highly effective, as exemplified by the award-winning sugar system. We here develop an alternative approach based on ASP. This allows us to use first-order encodings providing us with a high degree of flexibility for easy experimentation with different implementations. The resulting sys...
متن کاملSolving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can be used to model combinatorial problems containing contingency or uncertainty. It allows for universally quantified variables that can model uncertain actions and events, such as the unknown weather for a future party, ...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computing
سال: 2011
ISSN: 0010-485X,1436-5057
DOI: 10.1007/s00607-011-0169-5